Typed connector families and their semantics
نویسندگان
چکیده
منابع مشابه
Curry-Typed Semantics in Typed Predicate Logic
Various questions arise in semantic analysis concerning the nature of types. These questions include whether we need types in a semantic theory, and if so, whether some version of simple type theory (STT, Church, 1940) is adequate or whether a richer more flexible theory is required to capture our semantic intuitions. Propositions and propositional attitudes can be represented in an essentially...
متن کاملConnector Semantics for Sketched Diagram Recognition
Comprehensive interpretation of hand-drawn diagrams is a long-standing challenge. Connectors (arrows, edges and lines) are important components of many types of diagram. In this paper we discuss techniques for syntactic and semantic recognition of connectors. Undirected graphs, digraphs and organization charts are presented as exemplars of three broad classes that encompass many types of connec...
متن کاملTyped Operational Semantics for Higher
Bounded operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce F ! , a variant of F ! <: with this feature and with Cardelli and Wegner's kernel Fun rule for quantiiers. We deene a typed operational semantics with subtyp-ing and prove that it is equivalent with F ! , using a Kripke m...
متن کاملInitiality for Typed Syntax and Semantics
We give an algebraic characterization of the syntax and semantics of a class of simply–typed languages, such as the language PCF: we characterize simply–typed binding syntax equipped with reduction rules via a universal property, namely as the initial object of some category. For this purpose, we employ techniques developed in two previous works: in [2], we model syntactic translations between ...
متن کاملTyped Machine Language and its Semantics
We present TML, a new low level typed intermediate language for the proof-carrying code framework. The type system of TML is expressive enough to compile high level languages like core ML to and can be guaranteed sound. It is also flexible enough to provide a lot of freedom for low-level data representations. We can model real machine instructions in TML, and thus avoid high-level opaque operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2017
ISSN: 0167-6423
DOI: 10.1016/j.scico.2017.03.002